White Pattern based map comparisons

نویسنده

  • Roger White
چکیده

Map comparison techniques based on a pixel-by-pixel comparison are useful for many purposes, but fail to reveal important aspects of map similarities and differences. In contrast, pattern based map comparison techniques address the question of structural similarity, although with these approaches the comparison problem becomes open ended, since there is an unlimited number of ways to characterise a pattern. Two types of pattern based technique are used here to analyse the test sets of maps. The first, a fuzzy polygon based matching technique, focuses on the meso-scale aspects of pattern. It is based on the areal intersection of land use polygons on the two maps being compared. The areal intersection, areal complement, and polygon size values are fuzzified into an appropriate set of categories, a set of fuzzy inference rules is applied to derive memberships in local matching categories, and finally the local matching category memberships are defuzzified to yield local matching values for each land use polygon on the reference map. The second approach, fractal analysis, captures macro-scale or global qualities of the maps. Two measures are calculated here: the radial dimension and the cluster size—frequency dimension. The polygon matching approach provides only limited insight when applied to the case of the map set representing differences in classification. It proves much more effective when applied to the problem of change detection, revealing areas where the pattern has changed and giving local measures of the degree of change. The approach is particularly useful in the case where there is a considerable degree of random change at the pixel level, as changes in the underlying pattern are extracted from the noise, while pixel based approaches largely detect the noise.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image encryption based on chaotic tent map in time and frequency domains

The present paper is aimed at introducing a new algorithm for image encryption using chaotic tent maps and the desired key image. This algorithm consists of two parts, the first of which works in the frequency domain and the second, in the time domain. In the frequency domain, a desired key image is used, and a random number is generated, using the chaotic tent map, in order to change the phase...

متن کامل

Testing a blowing snow model against distributed snow measurements at Upper Sheep Creek, Idaho, United States of America

In this paper a physically based snow transport model (SnowTran-3D) was used to simulate snow drifting over a 30 m grid and was compared to detailed snow water equivalence (SWE) surveys on three dates within a small 0.25 km subwatershed, Upper Sheep Creek. Two precipitation scenarios and two vegetation scenarios were used to carry out four snow transport model runs in order to (1) evaluate the ...

متن کامل

Reduced complexity Log-MAP algorithm with Jensen inequality based non-recursive max∗ operator for turbo TCM decoding

In this paper, a reduced complexity Log-MAP algorithm based on a non-recursive approximation of the max∗ operator is presented and studied for turbo trellis-coded modulation (TTCM) systems. In the algorithm, denoted as AvN Log-MAP, the max∗ operation is generalized and performed on n ≥ 2 arguments. The approximation is derived from the Jensen inequality. The non-recursive form of the max∗ calcu...

متن کامل

White Matter Deficits in Psychopathic Offenders and Correlation with Factor Structure

Psychopathic offenders show a persistent pattern of emotional unresponsivity to the often horrendous crimes they perpetrate. Recent studies have related psychopathy to alterations in white matter. Therefore, diffusion tensor imaging followed by tract-based spatial statistics (TBSS) analysis in 11 psychopathic offenders matched to 11 healthy controls was completed. Fractional anisotropy was calc...

متن کامل

Multi-scale edge finding in noisy pictures

Finding edges in digital images is a very basic and important task. This paper describes a new technique to address this problem. The proposed technique tries to solve two of the main difficulties that edge finding algorithms must face: uncertainty due to noise artifacts and combination of details detected at different scales. In particular we adapt a fuzzy arithmetic approach called “Fuzzy Mar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006